Stopped Markov chains with stationary occupation times

نویسندگان

  • Steven N. Evans
  • Jim Pitman
چکیده

Let E be a nite set equipped with a group G of bijective transformations and suppose that X is an irreducible Markov chain on E that is equivariant under the action of G. In particular, if E = G with the corresponding transformations being left or right multiplication, then X is a random walk on G. We show that when X is started at a xed point there is a stopping time U such that the distribution of the random vector of pre-U occupation times is invariant under the action of G. When G acts transitively (that is, E is a homogeneous space), any non-zero, nite expectation stopping time with this property can occur no earlier than the time S of the rst return to the starting point after all states have been visited. We obtain an expression for the joint Laplace transform of the pre-S occupation times for an arbitrary nite chain and show that even for random walk on the group of integers mod r the pre-S occupation times do not generally have a group invariant distribution. This appears to contrast with the Brownian analog, as there is considerable support for the conjecture that the eld of local times for Brownian motion on the circle prior to the counterpart of S is stationary under circular shifts. American Mathematical Society subject classi cations: Primary 60J10, 60J15. Secondary 60G40, 60J55.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Markov Decision Evolutionary Games with Expected Average Fitness

Aim: To model and characterize evolutionary games where individuals have states that are described by controlled Markov chains. The action of an individual in a local interaction with another randomly selected individual determines not only the instantaneous fitness but also its probability to move to another state. The goal of a player is to maximize its time average fitness. Mathematical meth...

متن کامل

Stationary Distributions and Mean First Passage Times of Perturbed Markov Chains

Stationary distributions of perturbed finite irreducible discrete time Markov chains are intimately connected with the behaviour of associated mean first passage times. This interconnection is explored through the use of generalized matrix inverses. Some interesting qualitative results regarding the nature of the relative and absolute changes to the stationary probabilities are obtained togethe...

متن کامل

Strong Stationary Times for Non-Uniform Markov Chains

This thesis studies several approaches to bounding the total variation distance of a Markov chain, focusing primarily on the strong stationary time approach. While strong stationary times have been used successfully with uniform walks on groups, non-uniform walks have proven harder to analyze. This project applied strong stationary techniques to simple non-uniform walks in the hope of finding s...

متن کامل

Generalized Inverses, Stationary Distributions and Mean First Passage Times with applications to Perturbed Markov Chains

Abstract In an earlier paper (Hunter, 2002) it was shown that mean first passage times play an important role in determining bounds on the relative and absolute differences between the stationary probabilities in perturbed finite irreducible discrete time Markov chains. Further when two perturbations of the transition probabilities in a single row are carried out the differences between the sta...

متن کامل

Finite Markov Chains and the Top-to-random Shuffle

In this paper, I present an introduction to Markov chains, basic tools to analyze them, and an example, the top-to-random shuffle. I cover the existence and uniqueness of stationary distributions, the Convergence Theorem, total variation distance, mixing time, and strong stationary times. Using these tools, I show that the top-to-random shuffle on a deck of n cards mixes the deck in approximate...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997